Lobatto-type quadrature formula in rational spaces
نویسندگان
چکیده
منابع مشابه
Lobatto Type Quadrature Rules for Functions with Bounded Derivative
Inequalities are obtained for quadrature rules in terms of upper and lower bounds of the first derivative of the integrand. Bounds of Ostrowski type quadrature rules are obtained and the classical Iyengar inequality for the trapezoidal rule is recaptured as a special case. Applications to numerical integration are demonstrated.
متن کاملGauss-type Quadrature Rules for Rational Functions
When integrating functions that have poles outside the interval of integration, but are regular otherwise, it is suggested that the quadrature rule in question ought to integrate exactly not only polynomials (if any), but also suitable rational functions. The latter are to be chosen so as to match the most important poles of the integrand. We describe two methods for generating such quadrature ...
متن کاملA Gauss–Lobatto quadrature method for solving optimal control problems
This paper proposes a direct approach for solving optimal control problems. The time domain is divided into multiple subdomains, and a Lagrange interpolating polynomial using the Legendre–Gauss– Lobatto points is used to approximate the states and controls. The state equations are enforced at the Legendre–Gauss–Lobatto nodes in a nonlinear programming implementation by partial Gauss–Lobatto qua...
متن کاملInterpolation approximations based on Gauss-Lobatto-Legendre-Birkhoff quadrature
We derive in this paper the asymptotic estimates of the nodes and weights of the Gauss-Lobatto-Legendre-Birkhoff (GLLB) quadrature formula, and obtain optimal error estimates for the associated GLLB interpolation in Jacobi weighted Sobolev spaces. We also present a useroriented implementation of the pseudospectral methods based on the GLLB quadrature nodes for Neumann problems. This approach al...
متن کاملRational Gauss Quadrature
The existence of (standard) Gauss quadrature rules with respect to a nonnegative measure dμ with support on the real axis easily can be shown with the aid of orthogonal polynomials with respect to this measure. Efficient algorithms for computing the nodes and weights of an n-point Gauss rule use the n × n symmetric tridiagonal matrix determined by the recursion coefficients for the first n orth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1998
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(98)00068-5